Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs
نویسندگان
چکیده
In this paper, we propose an algorithm for nding all the edge colorings in bipartite graphs. Our algorithm requires O(T (n;m; ) + Kminfn 2 +m; T (n;m; )g) time and O(m ) space, where n denotes the number of vertices, m denotes the number of edges, denotes the number of maximum degree, T (n;m; ) denotes the time complexity of an edge coloring algorithm, and K denotes the number of edge colorings.
منابع مشابه
An Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs
In this paper, we propose an algorithm for nding all the edge colorings in bipartite graphs. Our algorithm requires O(m log + Kminfn 2 +m;m log g) time and O(m ) space, where n denotes the number of vertices, m denotes the number of edges, denotes the number of maximum degree, and K denotes the number of edge colorings.
متن کاملSolving Matching Problems Efficiently in Bipartite Graphs
We investigate the problem maxDMM of computing a largest set of pairwise disjoint maximum matchings in undirected graphs as introduced by P. J. Slater in the case of trees. In this paper, n, m denote, respectively, the number of vertices and the number of edges. We solve maxDMM for bipartite graphs, by providing an O(n 1.5 m/ log n + mn log n)-time algorithm. We design better algorithms for com...
متن کاملAnalysis of Approximate Algorithms for Constrained and Unconstrained Edge-coloring of Bipartite Graphs Applied Research Bellcore
The problem of edge coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors An optimal algorithm uses the minimum number of colors to color the edges We consider several approximation algorithms for edge coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case We also brie y consider the constrained edge coloring ...
متن کاملAnalysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs
The problem of edge coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors An optimal algorithm uses the minimum number of colors to color the edges We consider several approximation algorithms for edge coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case We also present results on the constrained edge colori...
متن کاملBounded Max-colorings of Graphs
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most b and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes’ weights. In this paper we present complexity results and approximation algorithms for those problems on g...
متن کامل